/*
 * Copyright (c) "Neo4j"
 * Neo4j Sweden AB [http://neo4j.com]
 *
 * This file is part of Neo4j.
 *
 * Neo4j is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
package org.neo4j.gds.applications.algorithms.pathfinding;

/**
 * We need human-readable labels for e.g. progress tracking
 */
interface AlgorithmLabels {
    String ALL_SHORTEST_PATHS = "All Shortest Paths";
    String A_STAR = "AStar";
    String BELLMAN_FORD = "Bellman-Ford";
    String BFS = "BFS";
    String DELTA_STEPPING = "Delta Stepping";
    String DFS = "DFS";
    String DIJKSTRA = "Dijkstra";
    String K_SPANNING_TREE = "K Spanning Tree";
    String LONGEST_PATH = "LongestPath";
    String RANDOM_WALK = "RandomWalk";
    String SPANNING_TREE = "SpanningTree";
    String STEINER = "SteinerTree";
    String TOPOLOGICAL_SORT = "TopologicalSort";
    String YENS = "Yens";
}
